long code meaning in English
长码
Examples
- 2 . added long code and id operation function for canbus
2新增了can bus下：长编码功能识别号作业功能。 - If a retransmission is needed , additional redundant bits for error correcting are sent . concatenation of an inner code and an outer code may provide a high coding gain and the capacity of a long code to correct errors
级联码是将两个或多个单码级联，在不增加译码复杂度的情况下，可以得到高的编码增益，达到与长码相同的纠错能力。 - We analyze how bit error rate ( ber ) , average delay , and throughput of the two structures vary with the maximal number of transmission attempts , and find that syndrome - ahead structure is suited for short codes with poor error - correction capacity , while syndrome - behind structure is suited for long codes with powerful error - correction capacity
分析了该harq的可靠性、时延和流量与最大重传次数之间的关系，发现短码长、纠错能力低的码宜采用前向校正子结构，而长码长、纠错能力高的码宜采用后向校正子结构，二者具有互补性。 - The cdna of subunit b was 1470 nucleotides long coding for 489 amino acids with a conservative atp binding site " 324 - sgsit - 328 " and a predicted molecular mass of 54 . 29 kda . amino acid sequence alignment analysis suggested that the v - h + - atpase b subunit of s . salsa had high homology with other reported v - h + - atpase subunit b . the h + - atpase subunit h from s . salsa was a hydrophilic protein with 465 amino acids and a predicted molecular mass of 52 . 8 kda , which was encoded by a cdna with 1398 nucleotides in orf . blast analysis indicated that the h + - atpase subunit h from s . salsa had a high amino acid sequence identity with those coming from plants , but had relatively low sequence identity with those coming from other species
盐地碱蓬液泡膜h ~ + - atpaseb亚基是由1470个核苷酸编码的长达489个氨基酸的多肽，分子量约54 . 29kda ，存在保守的atp结合序列“ 324 - sgsit - 328 ” ，与其他物种来源的v - h ~ + - atpaseb亚基具有较高的氨基酸序列相似性； h亚基为亲水多肽，开放阅读框长达1398 - bp ，编码465个氨基酸残基，分子量约52 . 8kda ，与植物来源的液泡膜h ~ + - atpaseh亚基具有较高的氨基酸序列相似性，而与其他物种来源的v - h ~ + - atpaseh亚基同源性较低； c亚基开放阅读框为495 - bp ，编码164个氨基酸残基，分子量约16 . 6kda ，为一跨膜多肽，存在四个可能的跨膜区。 - Low - density parity - check ( ldpc ) codes are a class of capacity approaching error - correcting codes . by using low complexity sum - product algorithm , ldpc codes can get near shannon limit decoding performance with almost all errors detectable . for long code lengths , ldpc codes can even outperform turbo codes
低密度校验码是一种能逼近shannon容量限的渐进好码，在长码时其性能甚至超过了turbo码，其译码采用具有线性复杂度的和积算法，复杂度大大低于turbo码，并且几乎所有错误都是可检的。